Linear Preservers for Sylvester and Frobenius Bounds on Matrix Rank

Linear preservers of two-sided matrix majorization

For vectors X, <span style="fon...

Alternate Sylvester sums on the Frobenius set

The alternate Sylvester sums are Tm(a, b) = ∑ n∈NR(−1)n, where a and b are coprime, positive integers, and NR is the Frobenius set associated with a and b. In this note, we study the generating functions, recurrences and explicit expressions of the alternate Sylvester sums. It can be found that the results are closely related to the Bernoulli polynomials, the Euler polynomials, and the (alterna...

A Structured Rank - Revealing Method for Sylvester Matrix 1 )

We propose a displacement structure based rank-revealing algorithm for Sylvester matrix, then apply it to compute approximate greatest common division of two univariate polynomials with floating-point coefficients. This structured rank-revealing method is based on a stabilized version of the generalized Schur algorithm [8], and is a fast rank-revealing method in the sense that, all computations...

linear preservers of two-sided matrix majorization

for vectors x, y ∈ rn, it is said that x is left matrix majorizedby y if for some row stochastic matrix r; x = ry. the relationx ∼` y, is defined as follows: x ∼` y if and only if x is leftmatrix majorized by y and y is left matrix majorized by x. alinear operator t : rp → rn is said to be a linear preserver ofa given relation ≺ if x ≺ y on rp implies that t x ≺ ty onrn. the linear preservers o...

A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix